Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth
نویسندگان
چکیده
We have generalized and implemented the hybrid asynchronous algorithm, originally proposed for parallel simulations of the spin-flip Ising model, in order to carry out parallel kinetic Monte Carlo (KMC) simulations. The parallel performance has been tested using a simple model of thin-film growth in both 1D and 2D. We also briefly describe how the data collection must be modified as compared to the case of the spin-flip Ising model in order to carry out rigorous data collection. Due to the presence of a wide range of rates in the simulations, this algorithm turns out to be very inefficient. The poor parallel performance results from three factors: (1) the high probability of selecting a Metropolis Monte Carlo (MMC) move, (2) the low acceptance probability of boundary moves and (3) the high cost of communications which is required before every MMC move. We also find that the parallel efficiency in two dimensions is lower than in one-dimension due to the higher probability of selecting an MMC attempt, suggesting that this algorithm may not be suitable for KMC simulations of two-dimensional thin-film growth. 2005 Elsevier Inc. All rights reserved. PACS: 81.15.Aa; 05.10. a; 05.10.Ln; 89.20.Ff
منابع مشابه
Semirigorous synchronous sublattice algorithm for parallel kinetic Monte Carlo simulations of thin film growth
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin film growth. However, in some cases it is necessary to study systems over extended time and length scales, and therefore a parallel algorithm is desired. Here we describe an efficient, semirigorous synchronous sublattice algorithm for parallel kinetic M...
متن کاملParallelization strategies for Monte Carlo simulations of thin film deposition
Atomistic simulations of thin film deposition, based on the lattice Monte Carlo method, provide insights into the microstructure evolution at the atomic level. However, large-scale atomistic simulation is limited on a single computer—due to memory and speed constraints. Parallel computation, although promising in memory and speed, has not been widely applied in these simulations because of the ...
متن کاملSynchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth.
We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which ...
متن کاملReduction Strategies for Kinetic Monte Carlo Models of Thin Film Growth
Thin film deposition encompasses a variety of physical processes, which occur over a wide range of length and time scales. A major challenge in modeling and simulating thin film deposition is this disparity in scales. In this study we focus on an atomic-scale lattice model of surface processes. Kinetic Monte Carlo simulations provide stochastic realizations of the surface evolution, which may t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Physics
دوره 212 شماره
صفحات -
تاریخ انتشار 2006